Discrete Fourier analysis on a dodecahedron and a tetrahedron

نویسندگان

  • Huiyuan Li
  • Yuan Xu
چکیده

A discrete Fourier analysis on the dodecahedron is studied, from which results on a tetrahedron is deduced by invariance. The results include Fourier analysis in trigonometric functions, interpolation and cubature formulas on these domains. In particular, a trigonometric Lagrange interpolation on the tetrahedron is shown to satisfy an explicit compact formula and the Lebesgue constant of the interpolation is shown to be in the order of (logn).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

R . Wallach Symmetry , Representations , and Invariants Graduate Texts in Mathematics 255 Springer

In this appendix we shall find all the irreducible representations of the symmetry groups of the Platonic solids, by a mixture of geometric methods and algebraic methods similar to those used in Chapters 5 for representations of the classical groups. We shall also see how these representations occur naturally in the harmonic analysis of functions on the Platonic solids. This is a discrete analo...

متن کامل

DISCRETE FOURIER ANALYSIS ON FUNDAMENTAL DOMAIN OF Ad LATTICE AND ON SIMPLEX IN d-VARIABLES

A discrete Fourier analysis on the fundamental domain Ωd of the d-dimensional lattice of type Ad is studied, where Ω2 is the regular hexagon and Ω3 is the rhombic dodecahedron, and analogous results on d-dimensional simplex are derived by considering invariant and anti-invariant elements. Our main results include Fourier analysis in trigonometric functions, interpolation and cubature formulas o...

متن کامل

The competition numbers of regular polyhedra

The notion of a competition graph was introduced by J. E. Cohen in 1968. The competition graph C(D) of a digraph D is a (simple undirected) graph which has the same vertex set as D and has an edge between two distinct vertices x and y if and only if there exists a vertex v in D such that (x, v) and (y, v) are arcs of D. For any graph G, G together with sufficiently many new isolated vertices is...

متن کامل

Edge Unfoldings of Platonic Solids Never Overlap

Is every edge unfolding of every Platonic solid overlapfree? The answer is yes. In other words, if we develop a Platonic solid by cutting along its edges, we always obtain a flat nonoverlapping simple polygon. We also give self-overlapping general unfoldings of Platonic solids other than the tetrahedron (i.e., a cube, an octahedron, a dodecahedron, and an icosahedron), and edge unfoldings of so...

متن کامل

Non-extendible finite polycycles

We give a fairly simple proof of a result announced in [2] that there are only seven non-extendible finite (r, q)-polycycles: the tetrahedron without a face, the cube without a face, the octahedron without a face, the dodecahedron without a face, the icosahedron without a face, the split-vertex octahedron and the split-vertex icosahedron.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Math. Comput.

دوره 78  شماره 

صفحات  -

تاریخ انتشار 2009